The eigenvalues of a tridiagonal matrix in biogeography

نویسندگان

  • Boris Igelnik
  • Dan Simon
چکیده

We derive the eigenvalues of a tridiagonal matrix with a special structure. A conjecture about the eigenvalues was presented in a previous paper, and here we prove the conjecture. The matrix structure that we consider has applications in biogeography theory. 2011 Elsevier Inc. All rights reserved. 1. Main result and related work We prove the following theorem in this paper. Theorem 1. The (n + 1) (n + 1) tridiagonal matrix A 1⁄4 1 1=n 0 0 n=n 1 2=n . . . .. .. . . . . . . . . . . .. . .. . . . . 2=n 1 n=n 0 0 1=n 1 2 66666664 3 77777775 ð1Þ for any natural nP 4 has the (n + 1) eigenvalues xðAÞ 1⁄4 f0; 2=n; 4=n; . . . ; 2g 1⁄4 2k=n; k 2 1⁄20;n : ð2Þ This theorem was stated as a conjecture in [14] and is proven here in Sections 2–4. This type of matrix arises in biogeography theory, and its application is discussed in Section 5. There have been many papers published on explicit solutions of eigensystems of tridiagonal matrices of different structures. Some research on this topic includes [2,5,7,10,11,16]. The common feature of [2,5,7,16] is that the tridiagonal matrix A has the following structure: 0096-3003/$ see front matter 2011 Elsevier Inc. All rights reserved. doi:10.1016/j.amc.2011.05.054 ⇑ Corresponding author. E-mail address: [email protected] (D. Simon). Applied Mathematics and Computation 218 (2011) 195–201

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tridiagonal matrix construction by the quotient difference recursion formula in the case of multiple eigenvalues

In this paper, we grasp an inverse eigenvalue problem which constructs a tridiagonal matrix with specified multiple eigenvalues, from the viewpoint of the quotient difference (qd) recursion formula. We also prove that the characteristic and the minimal polynomials of a constructed tridiagonal matrix are equal to each other. As an application of the qd formula, we present a procedure for getting...

متن کامل

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

Eigendecomposition of Block Tridiagonal Matrices

Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large matrix sizes. In this paper, we address the problem of the eigendecomposition of block tridiagonal matrices by studying a connection between their eigenvalues and...

متن کامل

Eigenvalues of tridiagonal matrix using Strum Sequence and Gerschgorin theorem

In this paper, computational efficient technique is proposed to calculate the eigenvalues of a tridiagonal system matrix using Strum sequence and Gerschgorin theorem. The proposed technique is applicable in various control system and computer engineering applications. KeywordsEigenvalues, tridiagonal matrix, Strum sequence and Gerschgorin theorem. I.INTRODUCTION Solving tridiagonal linear syste...

متن کامل

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal

It is well-known how any symmetric matrix can be transformed into a similar tridiagonal one [1, 2]. This orthogonal similarity transformation forms the basic step for various algorithms. For example if one wants to compute the eigenvalues of a symmetric matrix, one can rst transform it into a similar tridiagonal one and then compute the eigenvalues of this tridiagonal matrix. Very recently an a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2011